NP-complete problems - PDFSEARCH.IO - Document Search Engine

NP-complete problems
Results: 1536

#	Item
441	CCCG 2011, Toronto ON, August 10–12, 2011 Bottleneck Steiner Tree with Bounded Number of Steiner Vertices A. Karim Abu-Affash∗ Paz Carmi† Add to Reading List Source URL: 2011.cccg.ca Language: English - Date: 2011-08-15 18:22:15 NP-complete problems Spanning tree Steiner tree problem NP-hard problems Minimum spanning tree Tree Vertex cover Rectilinear Steiner tree Connectivity Graph theory Theoretical computer science Mathematics
442	Tractable Parameterizations for the Minimum Linear Arrangement Problem Michael R. Fellows1 , Danny Hermelin2 , Frances Rosamond1 , and Hadas Shachnai3 1 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-06-22 19:48:39 NP-complete problems Vertex cover Tree decomposition Graph Voltage graph Dominating set Graph theory Theoretical computer science Mathematics
443	A Theory and Algorithms for Combinatorial Reoptimization? Hadas Shachnai1?? , Gal Tamir1 , and Tami Tamir2 1 2 Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2012-02-29 12:43:33 Operations research Complexity classes NP-complete problems Approximation algorithm Optimization problem Reduction NP Knapsack problem Dynamic programming Theoretical computer science Applied mathematics Computational complexity theory
444	INFORMS TRANSPORTATION SCIENCE Vol. 00, No. 0, Xxxxx 0000, pp. 000–000 issn \| eissn \| 00 \| 0000 \| 0001 Add to Reading List Source URL: tbenoist.pagesperso-orange.fr Language: English - Date: 2011-03-16 02:49:18 Mathematics NP-complete problems Supply chain management Marketing Heuristics Inventory Vehicle routing problem Travelling salesman problem Heuristic function Business Theoretical computer science Operations research
445	Counting Eulerian Circuits is #P-Complete Graham R. Brightwell Abstract We show that the problem of counting the number of Eulerian circuits in an undirected graph is complete for the class #P. The method employed is mod Add to Reading List Source URL: www.siam.org Language: English - Date: 2005-07-06 08:19:12 Eulerian path NP-complete problems BEST theorem Degree Connectivity Hamiltonian path Tree Graph Route inspection problem Graph theory Mathematics Theoretical computer science
446	Distributed Computing FS 2013 Prof. R. Wattenhofer Thomas Locher Add to Reading List Source URL: dcg.ethz.ch Language: English - Date: 2014-09-26 08:28:47 NP-complete problems Graph coloring Networks Connectivity Dominating set Edge coloring Network theory Copying mechanism Breadth-first search Graph theory Theoretical computer science Mathematics
447	A New Approach to Incremental Topological Ordering Michael A. Bender∗ Jeremy T. Fineman† Abstract Add to Reading List Source URL: www.comp.nus.edu.sg Language: English - Date: 2009-11-24 09:49:23 Search algorithms Network flow Topological sorting Directed acyclic graph Depth-first search Minor Tree NP-complete problems Spanning tree Graph theory Mathematics Combinatorics
448	URL: http://www.elsevier.nl/locate/entcs/volume61.html 19 pages Parameterized Complexity: The Main Ideas and Connections to Practical Computing Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:10:30 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Dominating set Kernelization Vertex cover Clique problem NP-complete Theoretical computer science Computational complexity theory Applied mathematics
449	Filtering: A Method for Solving Graph Problems in MapReduce Silvio Lattanzi∗ Benjamin Moseley† Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2011-04-18 22:39:50 NP-complete problems Combinatorial optimization Spanning tree Matching Vertex cover Graph coloring Minimum spanning tree Minimum cut Connected component Theoretical computer science Graph theory Mathematics
450	CCCG 2006, Kingston, Ontario, August 14–16, 2006 Minimizing the Number of Arcs Linking a Permutation of Points in the Plane Stephane Durocher∗ Chris Gray† Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-27 22:59:44 Applied mathematics Boolean algebra Boolean satisfiability problem Electronic design automation Logic in computer science Permutation Theoretical computer science Mathematics NP-complete problems

UPDATE